Random walk theory applied to language identification
نویسندگان
چکیده
In this paper we discuss the most recent evaluation of the RPI language identi cation system by the National Institute of Standards and Technologies (NIST). This system is based on an acousto-phonetic approach where the phonemes present in a language are identi ed by a hidden semi-Markov model (HSMM). The HSMM was also developed at RPI. Knowledge of these phonemes provides us with the necessary probabilistic framework for classi er design. The classi er used in this system is designed in such a way that language speci c scores generated during an evaluation form a random walk. Random walk theory has extensive applications in ecology, metallurgy, chemistry and physics. Until recently random walk theory has been primarily used as a tool for the measurement of the territory covered by a di using particle. We now show that random walk theory can be used to e ectively design a language identi cation system.
منابع مشابه
A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملCoassociative Grammar, Periodic Orbits and Quantum Random Walk over Z 1
This work will be devoted to the quantisation of the classical Bernoulli random walk over Z. As this random walk is isomorphic to the classical chaotic dynamical system x 7→ 2x mod 1 with x ∈ [0, 1], we will explore the rôle of classical periodic orbits of this chaotic map in relation with a non commutative algebra associated with the quantisation of the Bernoulli walk. In particular we show th...
متن کاملar X iv : q ua nt - p h / 02 09 10 0 v 1 1 7 Se p 20 02 Coassociative grammar , periodic orbits and quantum
This work will be devoted to the quantisation of the classical Bernoulli random walk over Z. As this random walk is isomorphic to the classical chaotic dynamical system x 7→ 2x mod 1 with x ∈ [0, 1], we will explore the rôle of classical periodic orbits of this chaotic map in relation with a non commutative algebra associated with the quantisation of the Bernoulli walk. In particular we show th...
متن کاملSome Results for Skip-free Random Walk
A random walk that is skip-free to the left can only move down one level at a time but can skip up several levels. Such random walk features prominently in many places in applied probability including queuing theory and the theory of branching processes. This article exploits the special structure in this class of random walk to obtain a number of simplified derivations for results that are muc...
متن کاملComparison of mean hitting times for a degree-biased random walk
Consider the random walk on graphs such that, at each step, the next visited vertex is a neighbor of the current vertex, chosen with probability proportional to the inverse of the square root of its degree. On one hand, for every graph with n vertices, the maximal mean hitting time for this degree-biased random walk is asymptotically dominated by n. On the other hand, the maximal mean hitting t...
متن کامل